Outer-product-free sets for polynomial optimization and oracle-based cuts
نویسندگان
چکیده
منابع مشابه
Outer-Product-Free Sets for Polynomial Optimization and Oracle-Based Cuts
Cutting planes are derived from specific problem structures, such as a single linear constraint from an integer program. This paper introduces cuts that involve minimal structural assumptions, enabling the generation of strong polyhedral relaxations for a broad class of problems. We consider valid inequalities for the set S ∩P , where S is a closed set, and P is a polyhedron. Given an oracle th...
متن کاملGeometry of Sample Sets in Derivative-free Optimization: Polynomial Regression and Underdetermined Interpolation
In recent years, there has been a considerable amount of work on the development of numerical methods for derivative-free optimization problems. Some of this work relies on the management of the geometry of sets of sampling points for function evaluation and model building. In this paper, we continue the work developed in [8] for complete or determined interpolation models (when the number of i...
متن کاملDerivative-Free Robust Optimization by Outer Approximations
We develop an algorithm for minimax problems that arise in robust optimization in the absence of objective function derivatives. The algorithm utilizes an extension of methods for inexact outer approximation in sampling a potentially infinite-cardinality uncertainty set. Clarke stationarity of the algorithm output is established alongside desirable features of the model-based trust-region subpr...
متن کاملPolynomial Running Times for Polynomial-Time Oracle Machines
This paper introduces a more restrictive notion of feasibility of functionals on Baire space than the established one from second-order complexity theory. Thereby making it possible to consider functions on the natural numbers as running times of oracle Turing machines and avoiding secondorder polynomials, which are notoriously difficult to handle. Furthermore, all machines that witness this st...
متن کاملA Simulation-Based Optimization Model for Scheduling New Product Development Projects in Research and Development Centers
a simulation-based optimization approach for the purpose of finding a near-optimal answer can be efficient and effective. In the present paper, first, the mathematical model for the project activity scheduling problem has been presented with a job shop approach. Then, using the Arena 14 software, the simulation model has been designed. Consequently, a numerical example has been solved via runni...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2020
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-020-01484-3